Nonmonotone Spectral Gradient Method for l_1-regularized Least Squares
نویسندگان
چکیده
منابع مشابه
A Barzilai-Borwein $l_1$-Regularized Least Squares Algorithm for Compressed Sensing
Problems in signal processing and medical imaging often lead to calculating sparse solutions to under-determined linear systems. Methodologies for solving this problem are presented as background to the method used in this work where the problem is reformulated as an unconstrained convex optimization problem. The least squares approach is modified by an l1-regularization term. A sparse solution...
متن کاملLeast – Squares Method For Estimating Diffusion Coefficient
Abstract: Determination of the diffusion coefficient on the base of solution of a linear inverse problem of the parameter estimation using the Least-square method is presented in this research. For this propose a set of temperature measurements at a single sensor location inside the heat conducting body was considered. The corresponding direct problem was then solved by the application of the ...
متن کاملLEAST – SQUARES METHOD FOR ESTIMATING DIFFUSION COEFFICIENT
Determining the diffusion coefficient based on the solution of the linear inverse problem of the parameter estimation by using the Least-square method is presented. A set of temperature measurements at a single sensor location inside the heat conducting body is required. The corresponding direct problem will be solved by an application of the heat fundamental solution.
متن کاملA Proximal-Gradient Homotopy Method for the L1-Regularized Least-Squares Problem
We consider the `1-regularized least-squares problem for sparse recovery and compressed sensing. Since the objective function is not strongly convex, standard proximal gradient methods only achieve sublinear convergence. We propose a homotopy continuation strategy, which employs a proximal gradient method to solve the problem with a sequence of decreasing regularization parameters. It is shown ...
متن کاملRegularized Least-Squares Classification
We consider the solution of binary classification problems via Tikhonov regularization in a Reproducing Kernel Hilbert Space using the square loss, and denote the resulting algorithm Regularized Least-Squares Classification (RLSC). We sketch the historical developments that led to this algorithm, and demonstrate empirically that its performance is equivalent to that of the well-known Support Ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2016
ISSN: 2310-5070,2311-004X
DOI: 10.19139/soic.v4i3.230